Random Walks on Diestel-leader Graphs

نویسنده

  • DANIELA BERTACCHI
چکیده

We investigate various features of a quite new family of graphs, introduced as a possible example of vertex-transitive graph not roughly isometric with a Cayley graph of some finitely generated group. We exhibit a natural compactification and study a large class of random walks, proving theorems concerning almost sure convergence to the boundary, a strong law of large numbers and a central limit theorem. The asymptotic type of the n-step transition probabilities of the simple random walk is determined.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions

The lamplighter group over Z is the wreath product Zq ≀ Z. With respect to a natural generating set, its Cayley graph is the Diestel-Leader graph DL(q, q). We study harmonic functions for the “simple” Laplacian on this graph, and more generally, for a class of random walks on DL(q, r), where q, r ≥ 2. The DL-graphs are horocyclic products of two trees, and we give a full description of all posi...

متن کامل

Green kernel estimates and the full Martin boundary for random walks on lamplighter groups and Diestel–Leader graphs

We determine the precise asymptotic behaviour (in space) of the Green kernel of simple random walk with drift on the Diestel–Leader graph DL(q, r), where q, r 2. The latter is the horocyclic product of two homogeneous trees with respective degrees q + 1 and r + 1. When q = r , it is the Cayley graph of the wreath product (lamplighter group) Zq Z with respect to a natural set of generators. We d...

متن کامل

Positive Harmonic Functions for Semi-isotropic Random Walks on Trees, Lamplighter Groups, and Dl-graphs

We determine all positive harmonic functions for a large class of “semiisotropic” random walks on the lamplighter group, i.e., the wreath product Zq ≀Z, where q ≥ 2. This is possible via the geometric realization of a Cayley graph of that group as the Diestel-Leader graph DL(q, q). More generally, DL(q, r) (q, r ≥ 2) is the horocyclic product of two homogeneous trees with respective degrees q+1...

متن کامل

Boundary and Entropy of Space Homogeneous Markov Chains

CNRS, Université de Rennes-1 and Technische Universität Graz We study the Poisson boundary (≡ representation of bounded harmonic functions) of Markov operators on discrete state spaces that are invariant under the action of a transitive group of permutations. This automorphism group is locally compact, but not necessarily discrete or unimodular. The main technical tool is the entropy theory whi...

متن کامل

Spectral Computations on Lamplighter Groups and Diestel-leader Graphs

The Diestel-Leader graph DL(q, r) is the horocyclic product of the homogeneous trees with respective degrees q+1 and r+1. When q = r, it is the Cayley graph of the lamplighter group (wreath product) Zq≀Z with respect to a natural generating set. For the “Simple random walk” (SRW) operator on the latter group, Grigorchuk and Żuk and Dicks and Schick have determined the spectrum and the (on-diago...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008